On Termination of the Direct Sum of Term-Rewriting Systems
نویسنده
چکیده
To cite this version: Michaël Rusinowitch. On termination of the direct sum of term rewriting systems. HAL is a multidisciplinary open access archive for the deposit and dissemination of scientific research documents, whether they are published or not. The documents may come from teaching and research institutions in France or abroad, or from public or private research centers. L'archive ouverte pluridisciplinaire HAL, est destinée au dépôt età la diffusion de documents scientifiques de niveau recherche, publiés ou non, ´ emanant desétablissements d'enseignement et de recherche français oú etrangers, des laboratoires publics ou privés.
منابع مشابه
On modularity in infinitary term rewriting
We study modular properties in strongly convergent infinitary term rewriting. In particular, we show that: • Confluence is not preserved across direct sum of a finite number of systems, even when these are non-collapsing. • Confluence modulo equality of hypercollapsing subterms is not preserved across direct sum of a finite number of systems. • Normalization is not preserved across direct sum o...
متن کاملCounterexamples to Termination for the Direct Sum of Term Rewriting Systems
The direct sum of two term rewriting systems is the union of systems having disjoint sets of function symbols. It is shown that the direct sum of two term rewriting systems is not terminating, even if these systems are both terminating. Keyword: Term rewriting system, termination Introduction A term rewriting system R is a set of rewriting rules M → N , where M and N are terms [1, 3, 5]. The di...
متن کاملModular Term Rewriting Systems and the Termination
The direct sum of two term rewriting systems (TRSs) [2,8] R, and R, is confluent if R, and R, are confluent [lo], but the direct sum is not necessarily terminating even if R, and R, are terminating [ll]; that is, termination is not a “modular” [6] property for general term rewriting systems. Recently, it was proved [9,5,12,4] that for some restricted classes of systems the direct sum is termina...
متن کاملModular Termination of r-Consistent and Left-Linear Term Rewriting Systems
A modular property of term rewriting systems is one that holds for the direct sum of two disjoint term rewriting systems iff it holds for every involved term rewriting system. A term rewriting system is r-consistent iff there is no term that can be rewritten to two different variables. We show that the subclass of left-linear and r-consistent term rewriting systems has the modular termination p...
متن کاملTermination of Term Rewriting: Interpretation and Type Elimination
We investigate proving termination of term rewriting systems by interpretation of terms in a well-founded monotone algebra. The well-known polynomial interpretations can be considered as a particular case in this framework. A classiication of types of termination , including simple termination, is proposed based on properties in the semantic level. A transformation on term rewriting systems eli...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Inf. Process. Lett.
دوره 26 شماره
صفحات -
تاریخ انتشار 1987